Algebraic recognizability of regular tree languages
نویسندگان
چکیده
منابع مشابه
Algebraic recognizability of regular tree languages
We propose a new algebraic framework to discuss and classify recognizable tree languages, and to characterize interesting classes of such languages. Our algebraic tool, called preclones, encompasses the classical notion of syntactic Σ-algebra or minimal tree automaton, but adds new expressivity to it. The main result in this paper is a variety theorem à la Eilenberg, but we also discuss importa...
متن کاملAlgebraic Recognizability of Languages
Recognizable languages of finite words are part of every computer science cursus, and they are routinely described as a cornerstone for applications and for theory. We would like to briefly explore why that is, and how this word-related notion extends to more complex models, such as those developed for modeling distributed or timed behaviors. In the beginning was the Word. . . Recognizable lang...
متن کاملRewriting preserving recognizability of finite tree languages
We show that left-linear generalized semi-monadic TRSs effectively preserving recognizability of finite tree languages (are EPRF-TRSs). We show that reachability, joinability, and local confluence are decidable for EPRFTRSs.
متن کاملConstruction of regular languages and recognizability of polynomials
A generalization of numeration system in which N is recognizable by finite automata can be obtained by describing a lexicographically ordered infinite regular language. Here we show that if P ∈ Q[x] is a polynomial such that P (N) ⊂ N then we can construct a numeration system in which the set of representations of P (N) is regular. The main issue in this construction is to setup a regular langu...
متن کاملAlgebraic constraints, automata, and regular languages
A class of decision problems is Boolean if it is closed under the set–theoretic operations of union, intersection and complementation. The paper introduces new Boolean classes of decision problems based on algebraic constraints imposed on transitions of finite automata. We discuss issues related to specifications of these classes from algebraic, computational and proof–theoretic points of view.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2005
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.03.038